Weak index versus Borel rank
نویسنده
چکیده
We investigate weak recognizability of deterministic languages of infinite trees. We prove that for deterministic languages the Borel hierarchy and the weak index hierarchy coincide. Furthermore, we propose a procedure computing for a deterministic automaton an equivalent minimal index weak automaton with a quadratic number of states. The algorithm works within the time of solving the emptiness problem.
منابع مشابه
On the Weak Index Problem for Game Automata
Game automata are known to recognise languages arbitrarily high in both the non-deterministic and alternating Rabin–Mostowski index hierarchies. Recently it was shown that for this class both hierarchies are decidable. Here we complete the picture by showing that the weak index hierarchy is decidable as well. We also provide a procedure computing for a game automaton an equivalent weak alternat...
متن کاملDefinable Operations On Weakly Recognizable Sets of Trees
Alternating automata on infinite trees induce operations on languages which do not preserve natural equivalence relations, like having the same Mostowski–Rabin index, the same Borel rank, or being continuously reducible to each other (Wadge equivalence). In order to prevent this, alternation needs to be restricted to the choice of direction in the tree. For weak alternating automata with restri...
متن کاملA New Approach to Rank One Linear Algebraic Groups
One can develop the basic structure theory of linear algebraic groups (the root system, Bruhat decomposition, etc.) in a way that bypasses several major steps of the standard development, including the self-normalizing property of Borel subgroups. An awkwardness of the theory of linear algebraic groups is that one must develop a lot of material before one can even characterize PGL2. Our goal he...
متن کاملWadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank
We consider Borel sets of finite rank A C A'" where cardinality of A is less than some uncountable regular cardinal K5. We obtain a "normal form" of A, by finding a Borel set Q, such that A and Q continuously reduce to each other. In more technical terms: we define simple Borel operations which are homomorphic to ordinal sum. to multiplication by a countable ordinal, and to ordinal exponentiati...
متن کاملLinear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However, when it comes to non-deterministic tree automata, none of these hierarchies is even close to be understood. Here we make an attempt in paving the way towards a clear understanding of tree automata. We concentrate on the class ...
متن کامل